- refutable theory
- опровержимая теория
Англо-русский словарь по исследованиям и ноу-хау. Е.Г. Коваленк. 2015.
refutable theory
Смотреть что такое "refutable theory" в других словарях:
Theory — The word theory has many distinct meanings in different fields of knowledge, depending on their methodologies and the context of discussion.In science a theory is a testable model of the manner of interaction of a set of natural phenomena,… … Wikipedia
Original proof of Gödel's completeness theorem — The proof of Gödel s completeness theorem given by Kurt Gödel in his doctoral dissertation of 1929 (and a rewritten version of the dissertation, published as an article in 1930) is not easy to read today; it uses concepts and formalism that are… … Wikipedia
Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… … Wikipedia
Undecidable problem — In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is impossible to construct an algorithm that leads to a yes or no answer the problem is not decidable.A decision problem is any … Wikipedia
Newton da Costa — at Berkeley in 1973 Photo courtesy George M. Bergman Full name Newton da Costa Born 16 September 1929 (1929 09 16) (age 82) Curitiba, B … Wikipedia
Steven N. S. Cheung — Steven Ng Sheong Cheung (Traditional Chinese: 張五常; Pinyin: Zhāng Wǔcháng; born December 1, 1935), a Hong Kong born economist, specializes in the fields of transaction costs and property rights. He is also the most expensive columnist in Hong Kong … Wikipedia
Intuitionism — This article is about Intuitionism in mathematics and philosophical logic. For other uses, see Ethical intuitionism. In the philosophy of mathematics, intuitionism, or neointuitionism (opposed to preintuitionism), is an approach to mathematics as … Wikipedia
Mathematical proof — In mathematics, a proof is a convincing demonstration (within the accepted standards of the field) that some mathematical statement is necessarily true.[1][2] Proofs are obtained from deductive reasoning, rather than from inductive or empirical… … Wikipedia
Irreducible complexity — This article covers irreducible complexity as used by those who argue for intelligent design. For information on irreducible complexity as used in Systems Theory, see Irreducible complexity (Emergence). Irreducible complexity (IC) is an argument… … Wikipedia
Paraconsistent logic — A paraconsistent logic is a logical system that attempts to deal with contradictions in a discriminating way. Alternatively, paraconsistent logic is the subfield of logic that is concerned with studying and developing paraconsistent (or… … Wikipedia
Ring a Ring o' Roses — Infobox Standard title=Ring a Ring o Roses comment= image size= caption=Musical variations of Ring a Ring o Roses , Alice Gomme, 1898. [Gomme, The Traditional Games of England, Scotland, and Ireland , p. 108.] writer= composer=Traditional… … Wikipedia
